Isomorphism certificates for undirected graphs
نویسندگان
چکیده
For a graph G, we are interested in a minimum-size subgraph of G which, along with an unlabelled copy of G, provides enough information to reconstruct G. We perform a preliminary study of such subgraphs, focusing on the cases where G is a complete tree or a grid. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Polynomial-time Algorithm for Determining the Graph Isomorphism
The methodology of positioning graph vertices relative to each other to solve the problem of determining isomorphism of two undirected graphs is developed. Based on the position of the vertex in one of the graphs, it is determined the corresponding vertex in the other graph. For the selected vertex of the undirected graph, define the neighborhoods of the vertices are defined. Next, it is constr...
متن کاملPolynomial-time algorithm for determining the graph isomorphism (v.2)
We develop the methodology of positioning graph vertices relative to each other to solve the problem of determining isomorphism of two undirected graphs. Based on the position of the vertex in one of the graphs, it is determined the corresponding vertex in the other graph. For the selected vertex of the undirected graph, we define the neighborhoods of the vertices. Next, we construct the auxili...
متن کاملGraph isomorphism and volumes of convex bodies
We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given n × n matrices, is equivalent to equalities of volumes of the induced three convex bounded polytopes intersected with a given sequence of balls, centered at the origin with radii ti ∈ (0, √ n − 1), where {ti} is an increasing sequence converging to √ n − 1. T...
متن کاملP-subgraph Isomorphism Computation and Upper Bound Complexity Estimation
An approach for subgraph isomorphism computation of parameter-ized graphs will be presented. Parameterized graphs (short: p-graphs) are extensions of undirected graphs by parameter vectors at the nodes and edges. We will deene p-graphs and basic concepts of subgraph isomorphism computation for p-graphs. A bottom-up algorithm for p-subgraph isomorphism computation according to a given search gra...
متن کاملLinear Programming Heuristics for the Graph Isomorphism Problem
An isomorphism between two graphs is a bijection between their vertices that preserves the edges. We consider the problem of determining whether two finite undirected weighted graphs are isomorphic, and finding an isomorphism relating them if the answer is positive. In this paper we introduce effective probabilistic linear programming (LP) heuristics to solve the graph isomorphism problem. We m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 256 شماره
صفحات -
تاریخ انتشار 2002